Designing a Deadlock-Free Train Scheduler: A Model Checking Approach
نویسندگان
چکیده
In this paper we present the approach used in the design of the scheduling kernel of an Automatic Train Supervision system (ATS). A formal model of the railway layout and of the expected service has been used to identify all the possible critical sections of the railway layout in which a deadlock might occur. For each critical section, the prevention of the occurrence of deadlocks is achieved by constraining the set of trains allowed to occupy these sections at the same time. The identification of the critical sections and the verification of the correctness of the logic used by the ATS is carried out by exploiting a model checking verification framework locally developed at ISTI and based on the tool UMC.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملDeadlock Avoidance in Train Scheduling: A Model Checking Approach
In this paper we present the deadlock avoidance approach used in the design of the scheduling kernel of an Automatic Train Supervision (ATS) system. The ATS that we have designed prevents the occurrence of deadlocks by performing a set of runtime checks just before allowing a train to move further. For each train, the set of checks to be performed at each step of progress is retrieved from stat...
متن کاملA Correct-by-Construction MDE Approach for QoS-Aware Scheduling: From Models to Implementation
Meeting multiple Quality of Service (QoS) requirements is now an important factor for the success of complex software systems. This paper presents a correct-byconstruction, automated, model-driven scheduler synthesis approach for scheduling system tasks so as to meet multiple QoS requirements. As a first step, it shows how software engineers can meet deadlock-freedom and timeliness requirements...
متن کاملStarvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...
متن کاملExtending CSP-Prover by deadlock-analysis: Towards the verification of systolic arrays
Csp-Prover provides a deep encoding of the process algebra Csp in the interactive theorem prover Isabelle. Here, we extend Csp-Prover by a framework for the deadlock-analysis of networks. As a typical example we study systolic arrays and prove in Csp-Prover that Kung's classical algorithm for matrix-multiplication is deadlock-free. 1 Introduction Among the various frameworks for the description...
متن کامل